Reverse Mathematics, Mass Problems, and Effective Randomness
نویسنده
چکیده
1 reverse mathematics z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z mass problems effective randomness Foundations of mathematics is the study of the most basic concepts and logical structure of mathematics as a whole. Reverse mathematics is a particular research program in the foundations of mathematics. The goal of reverse mathematics is to classify core mathematical theorems up to logical equivalence, according to which set-existence axioms are needed to prove them. This is carried out in the context of subsystems of second order arithmetic. This leads to a remarkably regular structure. A large number of theorems fall into a small number of equivalence classes. 3 Reverse mathematics of measure theory.
منابع مشابه
Recent Aspects of Mass Problems: Symbolic Dynamics and Intuitionism
Mass Problems: A set P ⊆ {0,1} may be viewed as a mass problem, i.e., a decision problem with more than one solution. By definition, the solutions of P are the elements of P . A mass problem is said to be solvable if at least one of its solutions is recursive. A mass problem P is said to be Muchnik reducible to a mass problem Q if for each solution of Q there exists a solution of P which is Tur...
متن کاملMass problems and randomness
A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if every member of Q Turing computes a member of P . We say that P is strongly reducible to Q if every member of Q Turing computes a member of P via a fixed Turing functional. The weak degrees and strong degrees are the equivalence classes of mass problems under weak and strong reduci...
متن کاملRecursion Theory and Symbolic Dynamics
A set P ⊆ {0,1}N may be viewed as a mass problem, i.e., a decision problem with more than one solution. By definition, the solutions of P are the elements of P . A mass problem is said to be solvable if at least one of its solutions is recursive. A mass problem P is said to be Muchnik reducible to a mass problem Q if for each solution of Q there exists a solution of P which is Turing reducible ...
متن کاملTutorial on Mass Problems
Let P be a set of reals viewed as a mass problem, i.e., a “decision problem with more than one solution.” Here the “solutions” of P are the elements of P . Many unsolvable mathematical problems are best viewed as mass problems. One says that a mass problem P is weakly reducible to a mass problem Q if for every solution Y of Q there exists a solution X of P such that X is Turing reducible to Y ....
متن کاملMass problems and measure-theoretic regularity
A well known fact is that every Lebesgue measurable set is regular, i.e., it includes an Fσ set of the same measure. We analyze this fact from a metamathematical or foundational standpoint. We study a family of Muchnik degrees corresponding to measure-theoretic regularity at all levels of the effective Borel hierarchy. We prove some new results concerning Nies’s notion of LR-reducibility. We bu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006